runtime.sudog.next (field)

50 uses

	runtime (current package)
		chan.go#L841: 	sgp.next = nil
		chan.go#L850: 	x.next = sgp
		chan.go#L860: 		y := sgp.next
		chan.go#L867: 			sgp.next = nil // mark as removed (see dequeueSudoG)
		mgc.go#L1813: 		sgnext = sg.next
		mgc.go#L1814: 		sg.next = nil
		proc.go#L466: 			sched.sudogcache = s.next
		proc.go#L467: 			s.next = nil
		proc.go#L495: 	if s.next != nil {
		proc.go#L524: 				last.next = p
		proc.go#L529: 		last.next = sched.sudogcache
		runtime2.go#L363: 	next *sudog
		select.go#L613: 	y := sgp.next
		select.go#L617: 			x.next = y
		select.go#L619: 			sgp.next = nil
		select.go#L624: 		x.next = nil
		select.go#L633: 		sgp.next = nil
		sema.go#L288: 	s.next = nil
		sema.go#L304: 				s.next = t.next
		sema.go#L308: 				if s.next != nil {
		sema.go#L309: 					s.next.parent = s
		sema.go#L323: 				t.next = nil
		sema.go#L344: 			pt = &t.next
		sema.go#L368: 			if s.parent.next != s {
		sema.go#L393: 			ps = &s.next
		sema.go#L412: 		t.next = s.next
		sema.go#L413: 		if t.next != nil {
		sema.go#L414: 			t.next.parent = t
		sema.go#L435: 		for s.next != nil || s.prev != nil {
		sema.go#L436: 			if s.next == nil || s.prev != nil && s.prev.ticket < s.next.ticket {
		sema.go#L447: 				s.parent.next = nil
		sema.go#L456: 	s.next = nil
		sema.go#L467: 	y := x.next
		sema.go#L472: 	x.next = b
		sema.go#L483: 		if p.next != x {
		sema.go#L486: 		p.next = y
		sema.go#L496: 	b := x.next
		sema.go#L498: 	x.next = y
		sema.go#L511: 		if p.next != y {
		sema.go#L514: 		p.next = x
		sema.go#L584: 		l.tail.next = s
		sema.go#L620: 		next := s.next
		sema.go#L621: 		s.next = nil
		sema.go#L662: 	for p, s := (*sudog)(nil), l.head; s != nil; p, s = s, s.next {
		sema.go#L664: 			n := s.next
		sema.go#L666: 				p.next = n
		sema.go#L674: 			s.next = nil